#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, k;
int a[N];
int cnt[N];
bool check(int x) {
  // (cnt[i] - cnt[j]) * 2 > i - j
  // cnt[i] * 2 - i > cnt[j] * 2 - j
  rep(i, 1, n) cnt[i] = cnt[i - 1] + (a[i] >= x);
  rep(i, 1, n) cnt[i] = cnt[i] * 2 - i;
  int mn = 0;
  rep(i, k, n) {
    mn = min(mn, cnt[i - k]);
    if (cnt[i] > mn) return true;
  }
  return false;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  rep(i, 1, n) cin >> a[i];
  int l = 1, r = n;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (check(mid))
      l = mid + 1;
    else
      r = mid - 1;
  }
  cout << r;
  return 0;
}